Construction of Edge-Disjoint Spanning Trees in the Torus and Application to Multicast in Wormhole-Routed Networks
نویسندگان
چکیده
A tree-based multicast algorithm for wormhole-routed torus networks, which makes use of multiple edge-disjoint spanning trees is presented. A technique for constructing two spanning trees in 2-dimensional torus networks is described. It is formally proven that this construction produces two edge-disjoint spanning trees in any 2-D torus network. Compared with an algorithm for construction of multiple edge-disjoint spanning trees in arbitrary networks, our construction produces signiicantly lower maximum and average path lengths. Finally, two approaches to providing single link fault tolerance with edge-disjoint spanning trees are presented and evaluated.
منابع مشابه
Tree-Based Multicast in Wormhole-Routed Torus Networks
A tree-based multicast algorithm for wormhole-routed torus networks which makes use of multiple edge-disjoint spanning trees is presented. Techniques for constructing two edge-disjoint spanning trees in 2-dimensional tori are rst described and analyzed. The disjoint spanning-tree multi-cast (DSTM) algorithm which uses the two disjoint spanning trees together with an up-down routing strategy to ...
متن کاملMulticast in Wormhole-Switched Torus Networks Using Edge-Disjoint Spanning Trees
A tree-based multicast algorithm for wormhole-switched networks which makes use of multiple edge-disjoint spanning trees is presented. The disjoint spanning-tree multicast, or DSTM, algorithm provides deadlock-free multicast routing that is fully compatible with unicast. Application of the DSTM algorithm to 2-dimensional torus networks is considered. A family of constructions of two spanning tr...
متن کاملMulti-node Broadcasting in All-Ported 3-D Wormhole-Routed Torus Using Aggregation-then-Distribution Strategy
In this paper, we investigate the multi-node broadcasting problem in a 3-D torus, where there are an unknown number of s source nodes located at unknown positions each intending to broadcast a message of size m bytes to the rest of the network. The torus is assumed to use the all-port model and the popular dimension-ordered routing. Existing congestion-free results are derived based on finding ...
متن کاملMulti-Node Broadcasting in a Wormhole-Routed 2-D Torus Using an Aggregation-then-Distribution Strategy
This paper presents an efficient multi-node broadcasting algorithm in a wormhole-routed 2-D torus, where there are an unknown number of s source nodes located on unknown positions each intending to broadcast a message of size m bytes to the rest of network. The torus is assumed to use the all-port model and the popular dimension-ordered routing. Most existing results are derived based on findin...
متن کاملPath-Based Multicast Communication in Wormhole-Routed Unidirectional Torus Networks
This paper addresses the problem of one-to-many, or multicast, communication in wormhole-routed, n-dimensional torus networks. The proposed methods are designed for systems that support intermediate reception, which permits multi-destination messages to be pipelined through several nodes, depositing a copy at each node. A key issue in the design of such systems is the routing function, which mu...
متن کامل